The size Ramsey number of short subdivisions of bounded degree 1 graphs ∗
نویسندگان
چکیده
5 For graphs G and F , write G → (F )` if any coloring of the edges of G with ` colors yields 6 a monochromatic copy of the graph F . Let positive integers h and d be given. Suppose S 7 is obtained from a graph S with s vertices and maximum degree d by subdividing its edges h 8 times (that is, by replacing the edges of S by paths of length h+ 1). We prove that there exits 9 a graph G with no more than (log s)s edges for which G→ (S)` holds, provided 10 that s ≥ s0(h, d, `), where s0(h, d, `) is some constant that depends only on h, d, and `. We 11 also extend this result to the case in which Q is a graph with maximum degree d on q vertices 12 with the property that every pair of vertices of degree greater than 2 are distance at least h+ 1 13 apart. This complements work of Pak regarding the size Ramsey number of ‘long subdivisions’ 14 of bounded degree graphs. 15
منابع مشابه
Ramsey numbers for bipartite graphs with small bandwidth
We estimate Ramsey numbers for bipartite graphs with small bandwidth and bounded maximum degree. In particular we determine asymptotically the two and three color Ramsey numbers for grid graphs. More generally, we determine the two color Ramsey number for bipartite graphs with small bandwidth and bounded maximum degree and the three color Ramsey number for such graphs with the additional assump...
متن کاملOn the Size-Ramsey Number of Hypergraphs
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-edge-coloring of H yields a monochromatic copy of G. Size-Ramsey numbers of graphs have been studied for almost 40 years with particular focus on the case of trees and bounded degree graphs. We initiate the study of size-Ramsey numbers for k-uniform hypergraphs. Analogous to the graph case, we cons...
متن کاملOn the Ramsey Number of Sparse 3-Graphs
We consider a hypergraph generalization of a conjecture of Burr and Erdős concerning the Ramsey number of graphs with bounded degree. It was shown by Chvátal, Rödl, Trotter, and Szemerédi [The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B 34 (1983), no. 3, 239–243] that the Ramsey number R(G) of a graph G of bounded maximum degree is linear in |V (G)|. We derive...
متن کاملA transference principle for Ramsey numbers of bounded degree graphs
We investigate Ramsey numbers of bounded degree graphs and provide an interpolation between known results on the Ramsey numbers of general bounded degree graphs and bounded degree graphs of small bandwidth. Our main theorem implies that there exists a constant c such that for every ∆, there exists β such that if G is an n-vertex graph with maximum degree at most ∆ having a homomorphism f into a...
متن کاملRamsey goodness of bounded degree trees
Given a pair of graphs G and H, the Ramsey number R(G,H) is the smallest N such that every red-blue coloring of the edges of the complete graph KN contains a red copy of G or a blue copy of H. If a graph G is connected, it is well known and easy to show that R(G,H) ≥ (|G| − 1)(χ(H) − 1) + σ(H), where χ(H) is the chromatic number of H and σ(H) is the size of the smallest color class in a χ(H)-co...
متن کامل